Homogeneous coloured multipartite graphs
نویسندگان
چکیده
We classify the countable homogeneous coloured multipartite graphs with any finite number of parts. By Fräıssé’s Theorem this amounts to classifying the families F of pairwise non-embeddable finite coloured multipartite graphs for which the class Forb(F) of multipartite graphs which forbid these is an amalgamation class. We show that once we understand such families F in the quadripartite case, things do not become any more complicated for larger numbers of parts.
منابع مشابه
Countable homogeneous multipartite graphs
We give a classification of all the countable homogeneous multipartite graphs. This generalizes the similar result for bipartite graphs given in [5]. 2010 Mathematics Subject Classification 05C99 keywords: multipartite graph, homogeneous, classification
متن کاملRamsey numbers in complete balanced multipartite graphs. Part I: Set numbers
The notion of a graph theoretic Ramsey number is generalised by assuming that both the original graph whose edges are arbitrarily bi–coloured and the sought after monochromatic subgraphs are complete, balanced, multipartite graphs, instead of complete graphs as in the classical definition. We previously confined our attention to diagonal multipartite Ramsey numbers. In this paper the definition...
متن کاملRamsey numbers in complete balanced multipartite graphs. Part II: Size numbers
The notion of a graph theoretic Ramsey number is generalised by assuming that both the original graph whose edges are arbitrarily bi–coloured and the sought after monochromatic subgraphs are complete, balanced, multipartite graphs, instead of complete graphs as in the classical definition. We previously confined our attention to diagonal multipartite Ramsey numbers. In this paper the definition...
متن کاملHomogeneous factorisations of complete multipartite graphs
A homogeneous factorisation of a graph is a partition of its arc set such that there exist vertex transitive subgroups M < G 6 Aut(Γ) with M fixing each part of the partition setwise and G preserving the partition and transitively permuting the parts. In this paper we study homogeneous factorisations of complete multipartite graphs such that M acts regularly on vertices. We provide a necessary ...
متن کاملPartitioning two-coloured complete multipartite graphs into monochromatic paths and cycles
We show that any complete k-partite graph G on n vertices, with k ≥ 3, whose edges are two-coloured, can be covered with two vertex-disjoint monochromatic paths of distinct colours. We prove this under the necessary assumption that the largest partition class of G contains at most n/2 vertices. This extends known results for complete and complete bipartite
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Eur. J. Comb.
دوره 42 شماره
صفحات -
تاریخ انتشار 2014